Burrows-Wheeler compression with variable length integer codes
نویسنده
چکیده
The final coder in Burrows-Wheeler compression is usually either an adaptive Huffman coder (for speed) or a complex of arithmetic coders for better compression. This article describes the use of conventional pre-defined variable length codes or universal codes and shows that they too can give excellent compression. The paper also describes a “sticky Move-to-Front” modification which gives a useful improvement in compression for most files.
منابع مشابه
Fountain codes for lossless data compression
This paper proposes a universal variable-length lossless compression algorithm based on fountain codes. The compressor concatenates the Burrows-Wheeler block sorting transform (BWT) with a fountain encoder, together with the closed-loop iterative doping algorithm. The decompressor uses a Belief Propagation algorithm in conjunction with the iterative doping algorithm and the inverse BWT. Linear-...
متن کاملSelective Application of Burrows-Wheeler Transformation for Enhancement of JPEG Entropy Coding
JPEG encodes a still image through a lossy encoding followed by a lossless entropy encoding. The entropy coding in JPEG is a combination of the runlength coding and a variable-length coding. The entropy encoding employed in JPEG aims to exploit repetition of strings within a block but not across blocks. We propose application of Burrows-Wheeler transformation (BWT) to exploit repetition of stri...
متن کاملA New Data Compression Algorithm for Sources with Memory based on Error Correcting Codes
A new fixed-length asymptotically optimal scheme for lossless compression of stationary ergodic tree sources with memory is proposed. Our scheme is based on the concatenation of the Burrows-Wheeler block sorting transform with the syndrome former of a linear errorcorrecting code. Low-density parity-check (LDPC) codes together with Belief Propagation decoding lead to linear compression and decom...
متن کاملA Simpler Analysis of Burrows-Wheeler Based Compression
In this paper we present a new technique for worst-case analysis of compression algorithms which are based on the Burrows-Wheeler Transform. We deal mainly with the algorithm proposed by Burrows and Wheeler in their first paper on the subject [6], called bw0. This algorithm consists of the following three essential steps: 1) Obtain the Burrows-Wheeler Transform of the text, 2) Convert the trans...
متن کاملImprovements to the Burrows-Wheeler Compression Algorithm: After BWT Stages
The lossless Burrows-Wheeler Compression Algorithm has received considerable attention over recent years for both its simplicity and effectiveness. It is based on a permutation of the input sequence − the Burrows-Wheeler Transform − which groups symbols with a similar context close together. In the original version, this permutation was followed by a Move-To-Front transformation and a final ent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Softw., Pract. Exper.
دوره 32 شماره
صفحات -
تاریخ انتشار 2002